Tiling layouts with dominoes
نویسندگان
چکیده
We explore the complexity of tiling finite subsets of the plane, which we call layouts, with a finite set of tiles. The tiles are inspired by Wang tiles and the domino game piece. Each tile is composed of a pair of faces. Each face is colored with one of possible colors. We want to know if a given layout is tileable by a given set of dominoes. In a tiling, dominoes that touch must do so at like-colored domino faces. We provide an time algorithm for tiling layouts that are paths or cycles. We also show that if the layout is partially tiled at the outset of the problem, then the tiling decision problem is NP-complete. We also show that the problem remains NP-complete even if the layout is a tree.
منابع مشابه
On the Tileability of Polygons with Colored Dominoes
We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable 2× 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P , a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces ha...
متن کاملThe complexity of domino tiling
In this paper, we study the problem of how to tile a layout with dominoes. For non-coloured dominoes, this can be determined easily by testing whether the layout graph has a perfect matching. We study here tiling with coloured dominoes, where colours of adjacent dominoes must match. It was known that this problem is NP-hard when the layout graph is a tree. We first strengthen this NP-hardness r...
متن کاملThe Complexity of Generalized Domino Tilings
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NPand #Pcompleteness) for different generalizations of dominoes in three and higher dimensions.
متن کاملTiling a (2 × n)-Board with Squares and Dominoes
The Fibonacci numbers and the Pell numbers can be interpreted as the number of tilings of a (1 × n)-board by colored squares and dominoes. We explore the tilings of (2 × n)-boards by colored squares and dominoes. We develop a recurrence relation and prove several combinatorial identities in the style of recent work by Benjamin and Quinn. We also give a bijection between these (2 × n)-tilings an...
متن کاملLecture 8: October 1
Consider a simply connected region S of the two-dimensional Cartesian lattice (e.g. a 2n× 2n chessboard). A tiling of S is a covering of all its squares by non-overlapping dominoes, each of which occupies two adjacent squares of the lattice. We want to generate u.a.r. a tiling of S. Such problems arise in statistical physics, where the tilings correspond to configurations of a so-called dimer s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004